vertex set meaning in English
顶点集
Examples
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency .
如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。 - A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
一个求外平面图最小反馈点集的多项式时间算法 - Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency
如果在两个图之间存在一个保持邻接性的1 - 1对应，则这两个图是同构的。 - A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph
摘要若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。 - A series of recent papers has aimed at giving good bounds of feedback vertex set for families of graphs broadly known as : butterflies , hypercubes , meshes , star graphs , and so on
摘要最近诸多文章旨在讨论关于反馈结点集的上下界问题，比如：蝴蝶网、超立方体、网格、星图等等。